/**
*      author: Y_Yao
*      created: 2025-02-10 20:37:47
**/

#include<bits/stdc++.h>

#define int LL
using namespace std;
using LL = long long;
const LL LLINF = 1e18;
const int INF = 0x3f3f3f3f;
const int N = 2e5 + 7;
int a[N],b[N],c[N];
int n,m;

void solve()
{
    cin >> n >> m;
    for(int i = 1;i <= n;i++)
    {
        cin >> a[i];
    }
    cin >> m;
    for(int i = 1;i < n;i++)
    {
        b[i] = m - a[i];
    }

    for(int i = 1;i <= n;i++)
    {
        c[i] = min(a[i],b[i]);
        if(i > 1 && c[i] < c[i-1])
        {
            c[i] = max(a[i],b[i]);
            if(c[i] < c[i-1])
            {
                cout << "NO" << endl;
                return;
            }
        }
    }
    cout << "YES" << endl;
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);

    int t = 1;
    cin >> t;
    while(t--)
    {
        solve();
    }
    return 0;
}